A new intuitional algorithm for solving heterogeneous fixed fleet routing problems : Passenger pickup algorithmGENCER, Cevriye; TOP, Ismail; AYDOGAN, Emel Kizilkaya et al.Applied mathematics and computation. 2006, Vol 181, Num 2, pp 1552-1567, issn 0096-3003, 16 p.Article

Structural information and communication complexityPELEG, David; SIBEYN, Jop.Theoretical computer science. 2005, Vol 333, Num 3, issn 0304-3975, 128 p.Conference Proceedings

Routing algorithms for DHTs: Some open questionsRATUASAINY, Sylvia; STOICA, Ion; SHENKER, Scott et al.Lecture notes in computer science. 2002, pp 45-52, issn 0302-9743, isbn 3-540-44179-4, 8 p.Conference Paper

An algorithm for node-capacitated ring routingFRANK, Andras; KIRALY, Zoltan; KOTNYEK, Balazs et al.Lecture notes in computer science. 2005, pp 249-258, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 10 p.Conference Paper

A genetic routing algorithm for a 2D-meshed fault-tolerant network systemSANGMOON LEE; DAEKEUN MOON; HAGBAE KIM et al.Lecture notes in computer science. 2002, pp 39-46, issn 0302-9743, isbn 3-540-43968-4, 8 p.Conference Paper

Artificial Potential Field and its application to the ship in dynamic uncertain environmentsYUANHUI LI; WEI GUAN; DEPENG ZHAO et al.Proceedings of SPIE, the International Society for Optical Engineering. 2007, pp 67902Z.1-67902Z.8, issn 0277-786X, isbn 978-0-8194-6954-0Conference Paper

Deterministic SkipNetHARVEY, Nicholas J. A; MUNRO, J. Ian.Information processing letters. 2004, Vol 90, Num 4, pp 205-208, issn 0020-0190, 4 p.Article

A mixed deflection and convergence routing algorithm: Design and performanceBARTH, D; BERTHOME, P; CZARCHOSKI, T et al.Lecture notes in computer science. 2002, pp 767-774, issn 0302-9743, isbn 3-540-44049-6, 8 p.Conference Paper

A new routing algorithm for delay-constrained dynamic multicastASAKA, Takuya; MIYOSHI, Takumi; TANAKA, Yoshiaki et al.European conference on universal multiservice networks. 2000, pp 231-238, isbn 0-7803-6419-8Conference Paper

Optical Path Dynamic Routing Algorithm based on Traffic PredictionOBARA, Keita; HASEGAWA, Hiroshi; SATO, Ken-Ichi et al.Proceedings of SPIE, the International Society for Optical Engineering. 2008, Vol 7137, issn 0277-786X, isbn 9780819473776, Part II, 713724.1-713724.5, 2Conference Paper

A limited path unicast QoS routing algorithmYANXING ZHENG; JING TIAN; ZHIFENG LIU et al.IEEE symposium on computers communications. 2004, isbn 0-7803-8623-X, 2Vol, vol2, 870-875Conference Paper

A list based threshold accepting algorithm for the capacitated vehicle routing problemTARANTILIS, C. D; KIRANOUDIS, C. T; VASSILIADIS, V. S et al.International journal of computer mathematics. 2002, Vol 79, Num 5, pp 537-553, issn 0020-7160Article

An approximation algorithm for the pickup and delivery vehicle routing problem on treesKATOH, Naoki; YANO, Taihei.Discrete applied mathematics. 2006, Vol 154, Num 16, pp 2335-2349, issn 0166-218X, 15 p.Conference Paper

One-staged wormhole routing for irregular faulty patterns in meshesTSAI, Ming-Jer.International conference on parallel and distributed simulation. 2004, pp 569-576, isbn 0-7695-2152-5, 1Vol, 8 p.Conference Paper

Low-Delay Dynamic Routing Using Fountain CodesBADARLA, Venkataramana; SUBRAMANIAN, Vijay; LEITH, Douglas J et al.IEEE communications letters. 2009, Vol 13, Num 7, pp 552-554, issn 1089-7798, 3 p.Article

Approximation algorithms for some vehicle routing problemsBAZGAN, Cristina; HASSIN, Refael; MONNOT, Jérome et al.Discrete applied mathematics. 2005, Vol 146, Num 1, pp 27-42, issn 0166-218X, 16 p.Article

A novel methodology for constructing secure multipath overlays : Ah hoc and P2P securitySANCHEZ ARTIGAS, Marc; GARCIA LOPEZ, Pedro; GOMEZ SKARMETA, Antonio F et al.IEEE internet computing. 2005, Vol 9, Num 6, pp 50-57, issn 1089-7801, 8 p.Article

Application of rough set for routing selection based on OSPF protocolYANBING LIU; HONG TANG; MENGHAO WANG et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28653-5, 2Vol, Part II, 654-661Conference Paper

Extending address space of IP networks with hierarchical addressingTINGRONG LU; CHENGCHENG SUI; YUSHU MA et al.Lecture notes in computer science. 2005, pp 499-508, issn 0302-9743, isbn 3-540-29643-3, 1Vol, 10 p.Conference Paper

BeeHive: An efficient fault-tolerant routing algorithm inspired by honey bee behaviorWEDDE, Horst F; FAROOQ, Muddassar; ZHANG, Yue et al.Lecture notes in computer science. 2004, pp 83-94, issn 0302-9743, isbn 3-540-22672-9, 12 p.Conference Paper

A parallel routing algorithm on 2-circulant networks employing the Hamiltonian Circuit Latin SquareCHO, Youngjoo; TAK, Dongkil; CHUNG, Ilyong et al.Lecture notes in computer science. 2004, pp 293-296, issn 0302-9743, isbn 3-540-24013-6, 4 p.Conference Paper

Binomial-tree fault tolerant routing in dual-cubes with large number of faulty nodesYAMIN LI; SHIETUNG PENG; WANMING CHU et al.Lecture notes in computer science. 2004, pp 51-56, issn 0302-9743, isbn 3-540-24127-2, 6 p.Conference Paper

Preemptive routing in ad hoc networksGOFF, Tom; ABU-GHAZALEH, Nael; PHATAK, Dhananjay et al.Journal of parallel and distributed computing (Print). 2003, Vol 63, Num 2, pp 123-140, issn 0743-7315, 18 p.Article

Minimum price inter-domain routing algorithmDI SORTE, Dario; REALI, Gianluca.IEEE communications letters. 2002, Vol 6, Num 4, pp 165-167, issn 1089-7798Article

Maté: A tiny virtual machine for sensor networksLEVIS, Philip; CULLER, David.Operating systems review. 2002, Vol 36, Num 5, pp 85-95, issn 0163-5980, 11 p.Conference Paper